Optimizing general chain programs

Optimizing Parallel SPMD Programs

We present compiler optimization techniques for explicitly parallel programs that communicate through a shared address space. The source programs are written in a single program multiple data (SPMD) style, and the machine target is a multiprocessor with physically distributed memory and hardware or software support for a single address space. Unlike sequential programs or data-parallel programs...

Optimizing design of breeding programs

Beef cattle breeders are increasingly being offered gene marker tests for important traits in the breeding objective. They must make an economically rational decision whether to use these tests. Besides a potential immediate effect in seedstock sales, gene marker tests will affect the genetic improvement rate in the population. To examine the returns in a multi-trait breeding objective a pseudo...

Modeling and optimizing MapReduce programs

MapReduce frameworks allow programmers to write distributed, dataparallel programs that operate on multisets. These frameworks offer considerable flexibility to support various kinds of programs and data. To understand the essence of the programming model better and to provide a rigorous foundation for optimizations, we present an abstract, functional model of MapReduce along with a number of c...

A General Technique for Automatically Optimizing Programs Through the Use of Proof Plans

Optimizing Bi-Objective Multi-Commodity Tri-Echelon Supply Chain Network

The competitive market and declined economy have increased the relevant importance of making supply chain network efficient. This has created many motivations to reduce the cost of services, and simultaneously, to increase the quality of them. The network as a tri-echelon one consists of Suppliers, Warehouses or Distribution Centers (DCs), and Retailer nodes. To bring the problem closer to real...